Secrecy Sum-Rate of Multi-User MISO Visible Light Communication Systems with Confidential Messages

نویسندگان

  • Thanh V. Pham
  • Anh T. Pham
چکیده

This paper studies the information theoretic secrecy sum-rate for multi-user multiple-input single-output (MU-MISO) visible light communication (VLC) systems with confidential messages. The well-known Zero-Forcing (ZF) precoding method is employed to ensure confidentiality among legitimate users and, at the same time, to prevent eavesdropper(s) from obtaining any information. Different from radio frequency (RF) counterpart wherein the average input power constraint is usually imposed on the derivation of channel capacity, the input data signal of VLC systems is amplitude constrained, leading to a peak input power constraint. The amplitude constraint gives rise to the complexity in obtaining an analytical expression for the capacity. In this paper, we analytically investigate a novel bound on the secrecy sum-rate of all legitimate users in MUMISO VLC systems, which is valid in high signal-to-noise ratio (SNR) regime. The secrecy sum-rate performance is then derived for two scenarios: known and unknown eavesdropper’s channel state information (CSI) at the transmitter.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Secrecy Capacity Region of a Multi-Antenna Gaussian Broadcast Channel with Confidential Messages

In wireless data networks, communication is particularly susceptible to eavesdropping due to its broadcast nature. Security and privacy systems have become critical for wireless providers and enterprise networks. This paper considers the problem of secret communication over the Gaussian broadcast channel, where a multi-antenna transmitter sends independent confidential messages to two users wit...

متن کامل

Strong Secrecy for Interference Channels: Achievable Rate Region and Degrees of Freedom

The achievable rate region and degrees of freedom are studied for interference channels with confidential messages under strong secrecy constraints. The problem is studied based on the framework of Han and Verdú’s channel resolvability theory. It is shown that if the random binning rate for securing a confidential message is slightly above the resolution of its corresponding wiretapped channel,...

متن کامل

The Gaussian Many-to-1 Interference Channel with Confidential Messages

The many-to-one interference channel has received interest by virtue of embodying the essence of an interference network while being more tractable than the general K-user interference channel. In this paper, we introduce information theoretic secrecy to this model and consider the many-to-one interference channel with confidential messages, in which each receiver, in particular, the one subjec...

متن کامل

Beamforming in Interference Networks: Multicast, MISO IFC and Secrecy Capacity

Motivated by the two-user beamforming in multiantenna interference channels, we characterize the upper boundary of the achievable single-user gain-region. The eigenvector corresponding to the maximum eigenvalue of the weighted sum of Hermitian forms of channel vectors is shown to achieve all points on the boundary in some given direction. Thereby, we solve three different beamforming problems, ...

متن کامل

Signalling-Optimal Beamformer For Multiuser MISO Broadcast Visible Light Communications

In this paper, we consider an optimal space constellation design for a multiuser multi-input single-output (MISO) visible light communication (VLC) broadcast system when channel state information is available at the transmitter. By utilizing the cooperation of multiuser interference, an optimal multidimensional additively uniquely decomposable constellation group (AUDCG) is designed to maximize...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017